Restarted randomized surrounding methods for solving large linear equations
نویسندگان
چکیده
A class of restarted randomized surrounding methods are presented to accelerate the algorithms by techniques for solving linear equations. Theoretical analysis shows that proposed method converges under row selection rule and convergence rate in expectation is also addressed. Numerical experiments further demonstrate efficient outperform existing overdetermined underdetermined equations, as well application image processing.
منابع مشابه
Fast Methods for Solving Linear Diophantine Equations
We present some recent results from our research on methods for finding the minimal solutions to linear Diophantine equations over the naturals. We give an overview of a family of methods we developed and describe two of them, called Slopes algorithm and Rectangles algorithm. From empirical evidence obtained by directly comparing our methods with others, and which is partly presented here, we a...
متن کاملFinite iterative methods for solving systems of linear matrix equations over reflexive and anti-reflexive matrices
A matrix $Pintextmd{C}^{ntimes n}$ is called a generalized reflection matrix if $P^{H}=P$ and $P^{2}=I$. An $ntimes n$ complex matrix $A$ is said to be a reflexive (anti-reflexive) matrix with respect to the generalized reflection matrix $P$ if $A=PAP$ ($A=-PAP$). In this paper, we introduce two iterative methods for solving the pair of matrix equations $AXB=C$ and $DXE=F$ over reflexiv...
متن کاملModified homotopy perturbation method for solving non-linear oscillator's equations
In this paper a new form of the homptopy perturbation method is used for solving oscillator differential equation, which yields the Maclaurin series of the exact solution. Nonlinear vibration problems and differential equation oscillations have crucial importance in all areas of science and engineering. These equations equip a significant mathematical model for dynamical systems. The accuracy o...
متن کاملMultiple Explicitly Restarted Arnoldi Method for Solving Large Eigenproblems
In this paper we propose a new approach for calculating some eigenpairs of large sparse nonHermitian matrices. This method, called Multiple Explicitly Restarted Arnoldi (MERAM), is particularly well suited for environments that combine different parallel programming paradigms. This technique is based on a multiple use of Explicitly Restarted Arnoldi method and improves its convergence. This tec...
متن کاملA matrix LSQR algorithm for solving constrained linear operator equations
In this work, an iterative method based on a matrix form of LSQR algorithm is constructed for solving the linear operator equation $mathcal{A}(X)=B$ and the minimum Frobenius norm residual problem $||mathcal{A}(X)-B||_F$ where $Xin mathcal{S}:={Xin textsf{R}^{ntimes n}~|~X=mathcal{G}(X)}$, $mathcal{F}$ is the linear operator from $textsf{R}^{ntimes n}$ onto $textsf{R}^{rtimes s}$, $ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2022
ISSN: ['1873-5452', '0893-9659']
DOI: https://doi.org/10.1016/j.aml.2022.108290